wavelet decomposit uncertain time seri data set multidimension sharpen uncertain data cluster graph stream gener dimension reduct problem wifi local task determin physic locat mobil devic wireless signal strength shown accur method indoor outdoor local power build block locat awar applic local techniqu requir train set signal strength read label ground truth locat map prohibit collect maintain map grow larg paper propos techniqu solv wifi slam problem gaussian process latent variabl model gp lvm determin latent space locat unlabel signal strength data show gp lvm combin motion dynam model reconstruct topolog connect graph signal strength sequenc combin learn gaussian process signal strength model perform effici local classif high dcardin data stream graphic model text paradigm text represent process invers classif problem invers problem classif system set prototyp case repres set categori similar function case classifi categori find cost minim attribut valu case reclassifi member prefer categori problem invers usual map case unknown categori increas applic classif system busi suggest invers problem signific benefit decis maker form sensit analysi analyt approach invers problem difficult formul constraint difficult determin investig invers problem develop genet algorithm studi perform problem difficulti increas develop real genet algorithm feasibl control tradit binari genet algorithm steepest ascent hill climb algorithm seri simul experi compar perform algorithm optim solut problem difficulti increas attribut class addit analyz algorithm effect level feasibl control oper design fit function determin approach result viabil real genet algorithm import feasibl control problem difficulti increas cluster massiv text categor data stream applic new group filter text crawl document organ requir real time cluster segment text data record categor data stream cluster problem number applic problem custom segment real time trend analysi present onlin approach cluster massiv text categor data stream statist summar methodolog present result illustr effect techniqu cluster massiv text categor data stream applic new group filter text crawl document organ requir real time cluster segment text data record categor data stream cluster problem number applic problem custom segment real time trend analysi present onlin approach cluster massiv text categor data stream statist summar methodolog present result illustr effect techniqu dens pattern mine graph stream massiv web commun networkappl creat data repres massiv sequenti stream edg convers telecommun network messag social network repres massiv stream edg stream typic larg larg amount underli activ network import applic domain determin frequent occur dens structur underli graph stream gener determin frequent dens pattern underli interact introduc model dens pattern mine propos probabilist algorithm determin structur pattern effect effici purpos probabilist approach creat summar graph stream pattern mine show summar approach lead effect effici result stream pattern mine number real synthet data set framework cluster massiv graph stream onlin auction framework cluster massiv ddomain data stream high dimension project cluster uncertain data stream effici queri process stream count cell processor frequent pattern mine uncertain data segment dbase stream model applic classif stream abstract trend analysi time seri data import research direct stream time seri problem challeng take account fact valu arriv seri high rate effect effici method requir order classifi stream time seri base trend valu continu arriv stream classif perform mean slide window focus valu stream stream time seri transform vector mean piecewis linear approxim pla techniqu pla vector sequenc symbol denot trend seri construct increment pla compos seri segment repres trend raw data effici memori method order determin class stream time seri determin stream time seri compris specif trend class perform evalu base real life dataset perform show effici propos approach respect classif time storag requir propos method order continu classifi set stream time seri trend monitor behavior set stream monitor content set trend class contour effici algorithm discov discrimin subsequ survei uncertain data algorithm applic classif segment massiv audio data stream observ failur desir undesir behavior pattern larg scale softwar system specif domain telecommun system inform system onlin web applic difficult examin runtim behavior system oper log trace system gener data order gigabyt dai make challeng process predict upcom critic problem identifi relev behavior pattern gap amount inform amount inform make decis low level data process correl synthes order creat high level decis help data actual high level data lai avail time decis make face viru attack word high level data real time real time research area event process deal process data view event make alert administr user system relev behavior pattern base rule determin advanc rule pattern describ typic circumst event experienc administr expert improv observ capabl time experi critic event circumst preced aid manual process appli result relat aspect overlap research area predict analyt improv effect gconnect connect index massiv disk dresid graph problem connect extrem import context massiv graph larg commun network social network graph desir determin minimum cut pair node problem solv classic literatur relat maximum flow problem effici solvabl larg graph disk resid graph effici process connect queri minimum cut problem typic solv varieti combinatori flow base techniqu requir random access underli edg graph paper propos develop connect index massiv disk resid graph edgesampl base approach creat compress represent underli graph compress represent held main memori deriv effici approxim minimum cut problem compress represent organ disk resid index structur present experiment result show result approach order magnitud effici queri process disk resid approach expens small amount accuraci high dimension index uncertain data framework cluster uncertain data stream unifi privaci uncertain data model locust onlin analyt process framework high dimension classif data stream index high demension data uncertainti framework condens dbase anonym string data random public inform curs dimension densiti base transform uncertain data mine framework classif segment massiv audio data stream string classif data stream string data recent import number applic comput molecular biologi protein analysi market basket data case string wide varieti substructur physic signific applic substructur repres import fragment dna string interest portion fraudul transact case desir determin ident locat extent substructur data difficult gener classif problem problem label entir string deal complex task determin string fragment kind behavior problem complic kind substr show complic nest pattern defin problem refer gener classif problem propos scalabl approach base hidden markov model problem show implement gener string classif procedur larg data base data stream present experiment result number larg data set data stream xproj framework project structur cluster xml document xml popular method data represent web databas recent year reason popular xml abil encod structur inform data record structur characterist data set make challeng problem varieti data mine problem problem cluster structur aspect data result high implicit dimension data represent result difficult cluster data meaning paper propos effect cluster algorithm xml data substructur document order gain insight import underli structur propos wai multipl structur inform xml document evalu qualiti intermedi cluster solut guid algorithm final solut reflect true structur behavior individu partit test algorithm varieti real synthet data set research author tsinghua univers discrimin subsequ discoveri sequenc cluster anonym string data point sampl versu space sampl dimension reduct privaci dpreserv text spars binari data sketch challeng experi prototyp multi dmodal stream analyt monitor applic system exploratori test dinstanc dcenter diagnosi high ddimension classif futurist queri process data stream invers classif problem applic research interest gener interest data mine data wareh databas system current research focus model manag analyz larg scale graph inform network data privaci preserv adversari data mine privaci preserv data process import topic recent advanc hardwar technolog lead widespread prolifer demograph sensit data rudimentari preserv privaci simpli hide inform sensit field pick user method satisfactori abil prevent adversari data mine real data record randomli distribut result field record correl correl suffici high adversari predict sensit field field paper studi problem privaci preserv adversari data mine hide minim set entri privaci sensit field satisfactorili preserv word data mine adversari accur recov hidden data entri model problem concis develop effici heurist algorithm find good solut practic extens perform studi conduct synthet real data set examin effect approach categori subject descriptor databas applic data mine tempor evolut data stream framework cluster massiv text categor data stream applic new group filter text crawl document organ requir real time cluster segment text data record categor data stream cluster problem number applic problem custom segment real time trend analysi present onlin approach cluster massiv text categor data stream statist summar methodolog present result illustr effect techniqu framework local supervis dimension reduct high dimension data high dimension data present challeng classif problem difficulti model precis relationship larg number featur variabl class variabl case desir reduc inform small number dimens order improv accuraci effect classif process data reduct studi problem unsupervis domain techniqu explor extens supervis case exist techniqu perform dimension reduct slow practic high dimension case techniqu find global discrimin data behavior data vari consider data local subspac show discrimin local challeng task global discrimin problem addit issu data local paper propos idea supervis subspac sampl order creat reduc represent data classif applic effici effect method exploit natur distribut class order sampl subspac class discrimin sampl approach procedur extrem fast scale linearli data set size dimension represent effici adapt similar measur biolog data bias reservoir sampl presenc stream evolut human dcomput interact project nearest neighbor search framework ddemand classif evolv data stream xrule effect algorithm structur classif xml data csr speaker recognit compress voip packet stream exploratori test instanc specif algorithm high dimension classif interact classif applic user find valuabl develop diagnost decis support method reveal signific classif behavior exemplar record approach addit advantag optim decis process individu record order design effect classif method paper propos subspac decis path method user abil interact explor small number node hierarch decis process signific classif characterist test instanc reveal addit sd path method provid enorm interpret construct view data class separ case classif behavior test instanc ambigu sd path method diagnost understand characterist result ambigu method combin abil human comput creat effect diagnost tool instanc center high dimension classif abnorm detect spurious popul data stream variabl constraint privaci preserv data mine onlin analysi commun evolut data stream danonym curs dimension recent year wide avail person data made problem privaci preserv data mine import number method recent propos privaci preserv data mine multidimension data record method privaci preserv data mine anonym record releas indistinguish entiti data note method anonym highli depend spatial local order effect implement techniqu statist robust high dimension space data spars concept spatial local longer easi defin applic point view paper view anonym problem perspect infer attack combin attribut show data larg number attribut consid quasi identifi difficult anonym data unaccept high amount inform loss exponenti number combin dimens make precis infer attack individu attribut partial rang provid analysi effect dimension anonym method conclud data set larg number attribut cluster techniqu chang diagnosi data stream wavelet decomposit string classif high dimension project cluster data stream chang diagnosi evolv data stream recent year progress hardwar technolog made organ store record larg stream transact data result databas grow limit rapid rate data show import trend time case understand visual diagnos evolut trend data stream fast continu import analyz predict trend quickli onlin fashion paper discuss concept veloc densiti estim techniqu understand visual determin trend evolut fast data stream show veloc densiti estim order creat tempor veloc profil spatial veloc profil period instant time profil order predict kind data evolut dissolut coagul shift method propos visual chang data trend singl onlin scan data stream comput requir linear number data point addit batch process techniqu propos order identifi combin dimens show greatest amount global evolut techniqu discuss paper easili extend spatio tempor data data snapshot fix instanc time data tempor compon evolut effect effici algorithm high ddimension outlier detect condens approach privaci preserv data mine issu research report earli dissemin content view transfer copyright publish distribut ibm prior public limit peer commun specif request public request fill reprint legal obtain copi articl payment royalti copi request ibm watson research center demand classif data stream current model classif problem ectiv handl burst class come time fact current model classif problem simpli concentr method pass classif model larg data set model data stream classif view data stream classif problem point view dynam approach simultan train test stream dynam classif data set model reflect real life situat ectiv desir classifi test stream real time evolv train test stream aim creat classif system train model adapt quickli underli data stream order achiev goal propos demand classif process dynam select window past train data build classifi empir result system maintain high classif accuraci evolv data stream provid cient solut classif task framework project cluster high dimension data stream data stream problem studi extens recent year great eas collect stream data natur stream data make essenti algorithm requir pass data recent singl scan stream analysi method propos context leverag user access pattern topic specif crawl leverag user access pattern topic specif crawl effici subspac sampl framework high ddimension data reduct partial supervis text categor human dcomput interact method project cluster proceed acm sigmod workshop research issu data mine knowledg discoveri inform retriev mind map xrule effect structur classifi xml data xml document recent ubiquit vari applic number applic classif import problem data mine domain current classif method xml document ir base method document treat bag word techniqu ignor signific amount inform hidden insid document paper discuss problem rule base classif xml data frequent discriminatori substructur xml document techniqu capabl find classif characterist document addit techniqu extend cost sensit classif show ectiv method respect classifi note methodolog discuss paper applic kind semi structur data systemat design distanc function data mine applic distanc function comput kei subtask data mine algorithm applic ectiv form distanc function express context data domain challeng trivial task find ectiv form distanc function text domain distanc function design consid import complex issu focu intens research decad final design distanc function domain reach detail empir test consensu qualiti result provid di erent variat increas abil collect data autom number kind data continu increas rapidli make increasingli di cult undertak ort data type import aspect distanc function design human end user applic design satisfi user requir regard ectiv creat systemat framework design distanc function sensit characterist data domain paper discuss framework goal creat distanc function autom minim work requir user show framework creat distanc function significantli ectiv popularli function euclidean metric nearest neighbor index nonlinear trajectori recent year problem index mobil object assum great import relev wide varieti applic previou result area propos index scheme object linear trajectori dimens paper present method index object nonlinear trajectori specif identifi condit call convex hull properti show trajectori satisfi condit index store care represent object tradit index structur wide varieti relev nonlinear trajectori satisfi condit result significantli expand class trajectori nearest neighbor index scheme devis show linear trajectori satisfi convex hull condit approxim represent found satisfi discuss exampl techniqu util find represent satisfi convex hull properti present empir result demonstr ectiv index method framework chang diagnosi data stream framework cluster evolv data stream cluster problem difficult problem data stream domain larg volum data arriv stream render tradit algorithm ineffici recent year conceptu reconstruct mine massiv incomplet data set incomplet data set ubiquit wide varieti applic domain intuit framework understand evolv data stream organ todai store larg stream transact data real time data show import trend time commerci applic valuabl provid user understand natur occur time data stream poster discuss process analysi signific trend data stream understand intuit friendli user hierarch subspac sampl unifi framework high dimension data reduct increas abil autom data collect made modern technolog typic size data collect continu grow recent year case desir store data reduc format order improv storag transfer time process requir data challeng design ectiv data compress techniqu preserv abil reduc format directli wide rang databas data mine applic paper propos idea hierarch subspac sampl order creat reduc represent data method natur estim local implicit dimension point ectiv creat variabl dimension reduc represent data techniqu advantag adapt adjust represent depend behavior local data point interest properti subspac sampl techniqu unlik data reduct techniqu cienci compress improv increas databas size highli desir properti data reduct system problem motiv larg size data set sampl approach procedur extrem fast scale linearli data set size dimension subspac sampl techniqu reveal import local subspac characterist high dimension data har ectiv solut problem select estim approxim nearest neighbor search meaning high ddimension nearest neighbor search human dcomput interact nearest neighbor search import wide problem number import applic domain domain dimension data represent high recent theoret result shown concept proxim nearest neighbor meaning high dimension case complex problem find good qualiti nearest neighbor data set difficult judg relev return result fact hard fulli autom system satisfi user qualiti nearest neighbor found directli involv process case high dimension data meaning nearest neighbor found question paper address complex problem high dimension nearest neighbor search user perspect design system effect cooper human comput system user visual represent carefulli chosen subspac data order repeatedli elicit prefer data pattern close relat queri point prefer order determin quantifi meaning nearest neighbor system find quantifi meaning nearest neighbor diagnos situat nearest neighbor found meaning effect classif string wavelet recent year technolog advanc map gene made increasingli easi store wide varieti biolog data data form long string difficult determin relev featur classif task typic dna string million charact long thousand string databas case classif behavior data hidden composit behavior segment string easili determin apriori problem complic classif task case classif behavior reflect global behavior string reflect local pattern enorm variat behavior string data set develop approach sensit global local behavior string purpos classif purpos exploit multi resolut properti wavelet decomposit order creat scheme mine classif characterist level granular result scheme turn effect practic wide rang problem collabor crawl mine user experi topic resourc discoveri rapid growth world wide web made problem topic specif resourc discoveri import recent year problem desir find web page satisfi predic user predic keyword queri topic queri arbitrari contraint techniqu focuss crawl intellig crawl recent propos topic specif resourc discoveri crawler linkag base hyperlink behavior order perform resourc discoveri recent studi shown topic correl hyperlink noisi show consist reliabl resourc discoveri process paper approach problem resourc discoveri perspect mine signific brows pattern world wide web user order model likelihood web page belong predic user behavior mine freeli trace larg public domain proxi world wide web refer techniqu collabor crawl mine collect user experi order find topic resourc strategi extrem effect topic consist world wide web brows pattern turn reliabl addit user center crawl system combin linkag base system creat system work effect system base pure user behavior hyperlink hierarch subspac sampl unifi framework high dimension data reduct increas abil autom data collect made modern technolog typic size data collect continu grow recent year case desir store data reduc format order improv storag transfer time process requir data challeng design ectiv data compress techniqu preserv abil reduc format directli wide rang databas data mine applic paper propos idea hierarch subspac sampl order creat reduc represent data method natur estim local implicit dimension point ectiv creat variabl dimension reduc represent data techniqu advantag adapt adjust represent depend behavior local data point interest properti subspac sampl techniqu unlik data reduct techniqu cienci compress improv increas databas size highli desir properti data reduct system problem motiv larg size data set sampl approach procedur extrem fast scale linearli data set size dimension subspac sampl techniqu reveal import local subspac characterist high dimension data har ectiv solut problem select estim approxim nearest neighbor search autom system web portal person paper propos system person web portal specif implement discuss refer web portal new feed servic techniqu propos effect categor manag person new feed obtain live new wire servic process consist step manual input requir build domain knowledg site specif autom compon domain knowledg order perform person categor present effect scheme advertis propos target inform user content web page advertis icon appear autom techniqu identifi sudden variat new pattern support new alert descript version softwar custom web site provid find local associ market basket data paper discuss techniqu discov local associ segment data cluster aggreg behavior data set di erent local segment case desir design algorithm ectiv discov local associ expos custom pattern speci aggreg behavior inform beveri target market present empir result show method signi cantli larger number associ discov analysi aggreg data redefin cluster high ddimension applic high dimension data challeng cluster algorithm inher sparsiti point recent research result high dimension data concept proxim cluster meaning discuss gener techniqu project cluster construct cluster arbitrarili align subspac lower dimension subspac specif cluster definit substanti gener realist techniqu limit method project origin set attribut gener project cluster techniqu view redefin cluster high dimension applic search hidden subspac cluster creat inter attribut correl provid concept extend cluster featur vector order make algorithm scalabl larg databas run time space requir algorithm adjust tradeoff accuraci fast algorithm onlin gener profil associ rule adapt piggyback scheme video don ddemand system multirout maximum flow network network design sourc node design sink node finit integr capac ij arc elementari flowisaflowofk unit flowoneacharci rout flowisaflow express neg linear sum elementari flow paper showhow determin maximum rout flow sequenc minflog nu kg maximum flow problem improv algorithm kishimoto solv problem sequenc maximum flow problem addit wehav simplifi extend basic theori discuss applic techniqu birkhoff theorem schedul problem effect interpret data mine visual interact primari aim data mine algorithm facilit discoveri concis interpret inform larg amount data current formal data mine algorithm reach goal reason focu pure autom techniqu impos constraint data mine algorithm data mine problem cluster associ rule requir specif problem formul object function paramet system fail user account effect make user loop effici interpret uniqu achiev leverag human visual percept intermedi data mine result system combin comput power comput intuit abil human provid solut achiev paper discuss number recent approach data mine algorithm line effect nearest neighbor index euclidean metric nearest neighbor search import oper wide multimedia databas higher dimens previou method nearest neighbor search ineffici requir comput nearest neighbor distanc larg fraction point space paper present approach process nearest neighbor search euclidean metric search small subset origin space approach effect approxim cluster encapsul geometr regular shape comput upper lower bound distanc queri point cluster show effect propos approach perform extens experi result reveal propos approach significantli outperform tree sequenti scan effect conceptu index similar search text data similar search text proven interest problem qualit perspect inher redund ambigu textual descript method search engin order retriev document similar user defin set keyword applic target medium larg size document greater nois effect stem presenc larg number word unrel topic document invert represent domin method index text suitabl document document similar search short user queri improv qualiti similar search latent semant index lsi map document origin set word concept space lsi map data domain provid effect index techniqu paper investig wai provid conceptu search document creat represent term conceptu word chain techniqu effect index techniqu similar queri perform larg collect document access small amount data demonstr scheme outperform standard textual similar search invert represent term qualiti search effici surpris behavior distanc metric high dimension space recent year effect curs high dimension studi great detail problem cluster nearest neighbor search index high dimension space data spars tradit index algorithm techniqu fail effici effect perspect recent research result show high dimension space concept proxim distanc nearest neighbor qualit meaning paper view dimension curs point view distanc metric measur similar object specif examin behavior commonli lk norm show problem meaning high dimension sensit mean manhattan distanc metric norm consist prefer euclidean distanc metric norm high dimension data mine applic intuit deriv analysi introduc examin natur extens lk norm fraction distanc metric show fraction distanc metric meaning result theoret empir perspect result show fraction distanc metric significantli improv effect standard cluster algorithm mean algorithm human dcomput cooper system effect high dimension cluster high dimension data challeng cluster algorithm inher sparsiti point techniqu recent propos find cluster hidden subspac data behavior data vari consider subspac difficult defin notion cluster simpl mathemat formal fact meaning definit cluster character human intuit paper propos system perform high dimension cluster effect cooper human comput complex task cluster creation accomplish combin human intuit comput support provid comput result system leverag abil human comput order creat meaning set cluster high dimension mine massiv incomplet data set conceptu reconstruct incomplet data set ubiquit wide varieti applic domain common exampl found climat imag data set sensor data set medic data set incomplet data set aris number factor case simpli reflect measur time inform lost due partial system failur simpli result user unwil attribut due privaci concern signific fraction entri miss attribut difficult perform kind reason extrapol origin data case introduc idea conceptu reconstruct creat effect conceptu represent data mine algorithm directli appli attract idea conceptu reconstruct correl structur data order express term concept origin dimens result reconstruct procedur estim conceptu aspect data mine incomplet data set forc error creat extrapol demonstr effect approach varieti real data set design quantif privaci preserv data mine algorithm design quantif privaci preserv data mine algorithm effect dimension reduct high dimension similar search dimension curs profound effect effect high dimension similar index perform perspect techniqu improv index perform method dimension reduct techniqu data transform lower dimension space find axissystem data varianc preserv dimens reduct posit effect qualiti similar data domain text domain lead loss inform degrad search qualiti recent research improv text domain caus enforc semant concept data paper provid intuit model effect dimension reduct arbitrari high dimension problem provid effect diagnosi causal qualit effect dimension reduct data set analysi suggest effect data depend analysi accept techniqu pick reduct result loss inform maxim precis recal necessarili optimum qualit perspect demonstr make simpl implement detail dimension reduct techniqu consider improv qualiti similar search outlier detect high dimension data outlier detect problem import applic eld fraud detect netw ork robust analysi intrus detect suc applic high dimension domain whic hthe data con tain hundr dimens recen algorithm concept pro ximiti order outlier base relationship rest data ho high dimension space data spars notion proxim fail retain meaning fact sparsiti high dimension data impli point equal good outlier perspect ofproxim base de nition high dimension data notion nding meaning outlier substanti complex obviou paper discuss techniqu outlier detect whic outlier studi behavior project data set intellig crawl world wide web arbitrari predic enorm growth world wide web recent year made import perform resourc discoveri effici idea propos recent year kei techniqu focus crawl crawl topic portion world wide web quickli explor web page paper propos concept intellig crawl learn characterist linkag structur world wide web perform crawl specif intellig crawler inlink web page content candid url structur behavior inlink web page sibl order estim probabl candid crawl gener framework focus crawl techniqu base pre defin understand topic structur web techniqu discuss paper applic crawl web page satisfi arbitrari user defin predic topic queri keyword queri combin unlik focus crawl provid repres topic exampl crawler learn topic refer techniqu intellig crawl adapt natur adjust web page linkag structur learn crawler capabl reus knowledg gain crawl order provid effici crawl close relat predic design learn crawler topic resourc discoveri maximum factor queue length batch scheme video don ddemand system approach onlin gener associ rule mine associ collect strength approach tree project algorithm gener frequent item set abstract effici discoveri maxim frequent itemset mfi larg databas import problem data mine approach suggest sequenti mine maxim frequent itemset search frequent itemset parallel approach genuin effect mine extrem larg databas work propos parallel method mine mfi pc cluster exploit relationship mfi local found cluster node global mfi deriv top mechan produc fewer candid substanti reduc number messag pass pc provid cluster base method partit databas achiev good balanc load node evalu method perform synthet real databas empir result show method superior perform direct applic typic sequenti mfi mine algorithm long pattern gener dens databas introduct associ rule mine ddesign distanc function distanc dbase applic high dimension data intellig recommend analyz depth gener long pattern igrid index revers dimension curs similar index high dimension space similar searc index problem ell kno wn di cult high dimension applic index structur show rapid degrad increas dimension whic hlead access en tire databas queri urthermor recen research result sho high dimension space concept similar meaning paper propos theigrid index method similar index distanc function meaning retain increas dimension addit techniqu show perform uniqu index structur percentag data access invers proport data dimension techniqu reli dimension high order pro vide perform cient similar result igridindex support special kind queri whic hw refer project rang queri queri whic increasingli relevan tfor high dimension data mine applic find gener project cluster high dimension space high dimension data challeng cluster algorithm inher sparsiti point recent research result high dimension data concept proxim cluster meaning discuss gener techniqu project cluster construct cluster arbitrarili align subspac lower dimension subspac specif cluster definit substanti gener realist techniqu limit method project origin set attribut gener project cluster techniqu view redefin cluster high dimension applic search hidden subspac cluster creat inter attribut correl provid concept extend cluster featur vector order make algorithm scalabl larg databas run time space requir algorithm adjust tradeoff accuraci nearest neighbor high dimension space nearest neighbor search high dimension space interest import problem relev wide varieti databas applic recent result show problem difficult perform issu qualiti issu paper discuss qualiti issu identifi gener notion nearest neighbor search relev problem high dimension space contrast previou approach notion nearest neighbor search treat dimens equal qualiti criterion select relev dimens project respect queri qualiti criterion rate data cluster queri point select project propos effici effect algorithm solv gener nearest neighbor problem experi base number real synthet data set show approach insight natur nearest neighbor search high dimension data data mine techniqu person paper discuss overview data mine techniqu person discuss standard techniqu order adapt increas abil system tailor specif user behavior discuss techniqu collabor filter content base method content base collabor filter method examin specif applic techniqu scenario broad advantag specif situat reminisc influenti paper hort hatch egg graph dtheoret approach collabor filter paper introduc approach ratingbas collabor filter techniqu commerc merchant offer group homogen item compact disk video book softwar contrast collabor filter techniqu algorithm graph theoret base twin concept hort predict demonstr paper techniqu fast scalabl accur requir modest learn curv make hierarch classif scheme order introduc context rate process call creativ link order find surpris atyp item recommend item cross group boundari techniqu kei engin intellig recommend algorithm ira project develop ibm research addit recommend engin ira situat analyz determin mix engin commerc merchant engin optim placement advertis merit build categor system supervis cluster paper investig supervis cluster order creat set categori classif document inform pre exist taxonomi order supervis creation set relat cluster freedom defin creat class show advantag supervis cluster control rang subject categor system address precis mathemat definit categori categor document priori knowledg definit categori discuss techniqu classifi distinguish close relat cluster final show empir categor system util machin deriv taxonomi perform manual categor process lower cost optim profit broadcast deliveri multimedia product data mine techniqu associ cluster classif text mine techniqu person method similar index market basket data recent year data mine method propos find structur inform market basket data associ rule model recent propos order discov pattern depend data paper discuss method index market basket data effici similar search techniqu applic util similar custom bui behavior order make peer recommend propos index call signatur tabl flexibl support wide rang similar function construct index structur independ similar function queri time result similar search algorithm show excel scalabl increas memori avail databas size fast algorithm project cluster research text cluster applic text cluster exist text cluster system cach world wide web continu increas demand inform servic internet show sign strain internet highli distribut system individu data object singl sourc host comput network link easili overload larg number user access popular data proxi cach popular reduc network bandwidth server load improv respons time user origin cach proxi cern wide paper describ softwar develop author investig altern techniqu cach world wide web object softwar complement tradit proxycach allow server explicitli grant deni permiss cach object support server initi callback invalid chang object introduct statist collect nsfnet backbon indic world wide web traffic exce unbalanc tree index multidimension object design analysi permut dbase pyramid broadcast onlin algorithm find profil associ rule onlin gener associ rule larg databas consist sale transact investig problem onlin mine associ rule larg databas show preprocess data effect order make suitabl repeat onlin queri preprocess algorithm take account storag space store preprocess data onlin process appli graph theoret search algorithm complex proport size output result onlin algorithm practic instantan term respons time algorithm support techniqu quickli discov associ rule larg itemset algorithm capabl find rule specif item anteced consequ associ rule present compact form elimin redund elimin redund onlin gener associ rule larg itemset interest onlin gener profil associ rule framework itemset gener problem find associ rule larg databas sale transact wide studi literatur discuss weak larg itemset method associ rule gener method evalu find itemset refer strongli collect itemset propos concept support itemset correl item itemset relat criterion stress import actual correl item absolut support previous propos method provid correl itemset necessarili applic larg databas provid algorithm good comput effici maintain statist robust fact algorithm reli rel measur absolut measur support impli method appli find associ rule dataset item sizeabl percentag transact dens dataset dataset item vari densiti neg associ rule framework optim www advertis mine larg itemset associ rule paper survei itemset method associ rule gener paper discuss past research topic studi relev import itemset method gener associ rule discuss number variat associ rule problem propos literatur practic applic inher weak larg itemset method associ rule gener explor discuss formul associ viabl altern tradit associ rule gener method introduct associ rule find relationship item databas sale transact rule track bui pattern consum behavior find presenc item transact affect presenc problem associ rule gener recent gain consider promin diagnos infeas network flow problem problem find feasibl flow direct node suppli arc lower bound flow upper bound ij feasibl problem transform maximum flow problem feasibl flow network subset node net suppli node exce capac arc eman set call wit infeas simpli wit network flow problem case wit infeas problem small cardin wit prefer practic gener easier user assimil provid guidanc user identifi infeas show problem find minimum cardin wit np hard problem determin minim wit wit proper subset wit paper show determin minim wit solv sequenc maximum flow problem preflow push algorithm solv result maximum flow problem organ comput properli total time algorithm compar solv singl maximum flow problem approach determin minim cardin wit time simpl data structur nm log time dynam tree data structur disk cach web object proxi server dtree effici index multidimension object optim batch polici video don ddemand storag server optim piggyback merg polici video don ddemand system abstract critic issu perform video demand system bandwidth quir order satisfi client request number techniqu propos order reduc bandwidth requir paper concentr techniqu adapt piggyback ing develop analyz piggyback merg poli ci optim larg class reason method effici select algorithm pyramid 